K-best Spanning Tree Parsing
نویسنده
چکیده
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored constraints of the MST algorithm significantly inhibit parsing accuracy, we show that generating the 50-best parses according to an edge-factored model has an oracle performance well above the 1-best performance of the best dependency parsers. This motivates our parsing approach, which is based on reranking the kbest parses generated by an edge-factored model. Oracle parse accuracy results are presented for the edge-factored model and 1-best results for the reranker on eight languages (seven from CoNLL-X and English).
منابع مشابه
Log-Linear Models of Non-Projective Trees, $k$-best MST Parsing and Tree-Ranking
We present our system used in the CoNLL 2007 shared task on multilingual parsing. The system is composed of three components: a k-best maximum spanning tree (MST) parser, a tree labeler, and a reranker that orders the k-best labeled trees. We present two techniques for training the MST parser: tree-normalized and graphnormalized conditional training. The treebased reranking model allows us to e...
متن کاملK-Best Spanning Tree Dependency Parsing With Verb Valency Lexicon Reranking
A novel method for hybrid graph-based dependency parsing of natural language text is proposed. It is based on k-best maximum spanning tree dependency parsing and evaluation of the spanning trees by using a verb valency lexicon for a given language as a reranking knowledge base. The approach is compared with existing state-of-the-art transition-based and graph-based approaches to dependency pars...
متن کاملMaximising Spanning Subtree Scores for Parsing Tree Approximations of Semantic Dependency Digraphs
We present a method for finding the best tree approximation parse of a dependency digraph for a given sentence, with respect to a dataset of semantic digraphs as a computationally efficient and accurate alternative to DAG parsing. We present a training algorithm that learns the spanning subtree parses with the highest scores with respect to the data, and consider the output of this algorithm a ...
متن کاملOnline Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow dependency structures with multiple parents per word. We show that those extensions can make the MST framework computationally intractable, but that the intractability can be circumvented with new approximate parsing algori...
متن کاملCOLING 2012 24 th International Conference on Computational Linguistics
A novel method for hybrid graph-based dependency parsing of natural language text is proposed.It is based on k-best maximum spanning tree dependency parsing and evaluation of the spanningtrees by using a verb valency lexicon for a given language as a reranking knowledge base.The approach is compared with existing state-of-the-art transition-based and graph-basedapproaches to...
متن کامل